- height of rooted tree
- т. граф. высота корневого дерева
English-Russian scientific dictionary. 2008.
height of rooted tree
Смотреть что такое "height of rooted tree" в других словарях:
Tree (data structure) — A simple unordered tree; in this diagram, the node labeled 7 has two children, labeled 2 and 6, and one parent, labeled 2. The root node, at the top, has no parent. In computer science, a tree is a widely used data structure that emulates a… … Wikipedia
Tree traversal — Graph and tree search algorithms Alpha beta pruning A* B* Beam Bellman–Ford algorithm Best first Bidirectional … Wikipedia
Tree (set theory) — In set theory, a tree is a partially ordered set (poset) ( T … Wikipedia
Tree rotation — A tree rotation is an operation on a binary search tree that changes the structure without interfering with the order of the elements. A tree rotation moves one node up in the tree and one node down. They are used to change the shape of the tree … Wikipedia
Binary tree — Not to be confused with B tree. A simple binary tree of size 9 and height 3, with a root node whose value is 2. The above tree is unbalanced and not sorted. In computer science, a binary tree is a tree data structure in which each node has at… … Wikipedia
Red-black tree — A red black tree is a type of self balancing binary search tree, a data structure used in computer science, typically used to implement associative arrays. The original structure was invented in 1972 by Rudolf Bayer who called them symmetric… … Wikipedia
Leftist tree — A leftist tree or leftist heap is a priority queue implemented with a variant of a binary heap. Every node has an s value which is the distance to the nearest leaf. In contrast to a binary heap , a leftist tree attempts to be very unbalanced. In… … Wikipedia
Milliken's tree theorem — In mathematics, Milliken s tree theorem in combinatorics is a partition theorem generalizing Ramsey s theorem to infinite trees, objects with more structure than sets. Let T be a finitely splitting rooted tree of height ω, n a positive integer,… … Wikipedia
AVL tree — In computer science, an AVL tree is a self balancing binary search tree, and it is the first such data structure to be invented. [Robert Sedgewick, Algorithms , Addison Wesley, 1983, ISBN 0 201 06672 6, page 199, chapter 15: Balanced Trees.] In… … Wikipedia
Binary search tree — In computer science, a binary search tree (BST) is a binary tree data structurewhich has the following properties: *each node (item in the tree) has a value; *a total order (linear order) is defined on these values; *the left subtree of a node… … Wikipedia
K-ary tree — In graph theory, a k ary tree is a rooted tree in which each node has no more than k children. It is also sometimes known as a k way tree, an N ary tree, or an M ary tree. A binary tree is the special case where k=2. A full k ary tree is a k ary… … Wikipedia
